Hierarchical Point Matching Method Based on Triangulation Constraint and Propagation

Multiresolution Surface Modeling Based on Hierarchical Triangulation

modeling technique. The initial model consists in a surface ample, the resulting model should be defined in an objecttriangulation resulting from the integration of a set of range centered reference frame and non-uniform sampling of views. Thereafter, a hierarchical triangulation algorithm iterathe object surface should be allowed. For triangle-based tively removes vertices of the triangulation...

Constraint-Based Graph Matching

Measuring graph similarity is a key issue in many applications. We propose a new constraint-based modeling language for defining graph similarity measures by means of constraints. It covers measures based on univalent matchings, such that each node is matched with at most one node, as well as multivalent matchings, such that a node may be matched with a set of nodes. This language is designed o...

Constraint-Based Entity Matching

Entity matching is the problem of deciding if two given mentions in the data, such as “Helen Hunt” and “H. M. Hunt”, refer to the same real-world entity. Numerous solutions have been developed, but they have not considered in depth the problem of exploiting integrity constraints that frequently exist in the domains. Examples of such constraints include “a mention with age two cannot match a men...

Constraint - Based Schema Matching

Propagation strategies for stereo image matching based on the dynamic triangle constraint

For the purpose of reliable stereo image matching, this paper discusses a novel propagation strategy of image matching under the dynamic triangle constraint. Firstly, the construction and the dynamic updating method for the corresponding triangulations on the stereo pairs are introduced, which are used as both constraints and carriers during the matching propagation. Then, three propagation str...